Secure (n, n + 1)-Multi Secret Image Sharing Scheme Using Additive Modulo
نویسندگان
چکیده
منابع مشابه
Conditionally Secure Secrecy Computation using Secret Sharing Scheme for n<2k-1 (full paper)
Typically, when secrecy multiplication is performed in multiparty computation using Shamir’s (k, n) threshold secret sharing scheme, the result is a polynomial with degree of 2k − 2 instead of k − 1. This causes a problem where, in order to reconstruct a multiplication result, the number of polynomials needed will increase from k to 2k − 1. Shingu et al. proposed a method to solve the problem t...
متن کاملA Novel (2,n) Secret Image Sharing Scheme
In this paper, we propose a novel and simple (2, n) secret sharing scheme with precise reconstruction for grayscale, binary and color image. The share construction phase is based on pixel division and XOR operation. The reconstruction is based on XOR and OR operation. The proposed scheme has no pixel expansion and can reconstruct the secret image precisely. This scheme can be directly applied t...
متن کاملA New (k, n) Secret Image Sharing Scheme (SISS)
In this paper, a new (k, n) threshold Secret Image Sharing Scheme (SISS) is proposed. In the proposed scheme the secret image is first partitioned into several non-overlapping blocks of k pixels. Every k pixel is assumed as the vertices of a complete graph G. Each spanning tree of G is represented by k pixels along with Prüfer sequence and used to form k pixels of a share image. The original se...
متن کامل(t, n) Multi-Secret Sharing Scheme Based on Bivariate Polynomial
In a (t, n) secret sharing scheme (SS), a dealer divides the secret into n shares in such way that any t or more than t shares can reconstruct the secret but fewer than t shares cannot reconstruct the secret. The multi-SS is an extension of the (t, n) SS in which shares can be reused to reconstruct multiple secrets. Thus, the efficiency of the multi-SS is better than the efficiency of the (t, n...
متن کاملA ð t ; n Þ multi - secret sharing scheme q
10 In the ðt; nÞ multi-secret sharing scheme, there are n participants in the system. At 11 least t or more participants can easily pool their secrets shadows and reconstruct p 12 secrets at the same time. Chien et al. [IEICE Trans. Fundamentals E83-A (2000) 2762] 13 used (nþ p t þ 1) public values, ð2ðnþ pÞ tÞ ðnþ pÞ storages, and solved (nþ 14 p t) simultaneous equations to share p secrets. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2016
ISSN: 1877-0509
DOI: 10.1016/j.procs.2016.06.034